iSIRA: Integrated shift–invert residual Arnoldi method for graph Laplacian matrices from big data
نویسندگان
چکیده
منابع مشابه
Residual Arnoldi Methods : Theory ,
Title of dissertation: Residual Arnoldi Methods : Theory, Package, and Experiments Che-Rung Lee, Doctor of Philosophy, 2007 Dissertation directed by: Professor G.W. Stewart Department of Computer Science This thesis is concerned with the solution of large-scale eigenvalue problems. Although there are good algorithms for solving small dense eigenvalue problems, the large-scale eigenproblem has m...
متن کاملBig Data Quality: From Content to Context
Over the last 20 years, and particularly with the advent of Big Data and analytics, the research area around Data and Information Quality (DIQ) is still a fast growing research area. There are many views and streams in DIQ research, generally aiming at improving the effectiveness of decision making in organizations. Although there are a lot of researches aimed at clarifying the role of BIG data...
متن کاملCo-Localization from Labeled and Unlabeled Data Using Graph Laplacian
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals, a problem which we call colocalization, by exploiting both labeled and unlabeled data from mobile devices and access points. We first propose a solution using Latent Semantic Indexing to construct the relative locations of the mobile devices and access points when their abso...
متن کاملGraph Learning from Data under Structural and Laplacian Constraints
Graphs are fundamental mathematical structures used in various fields to represent data, signals and processes. In this paper, we propose a novel framework for learning/estimating graphs from data. The proposed framework includes (i) formulation of various graph learning problems, (ii) their probabilistic interpretations and (iii) associated algorithms. Specifically, graph learning problems are...
متن کاملAlgorithms, Graph Theory, and Linear Equations in Laplacian Matrices
The Laplacian matrices of graphs are fundamental. In addition to facilitating the application of linear algebra to graph theory, they arise in many practical problems. In this talk we survey recent progress on the design of provably fast algorithms for solving linear equations in the Laplacian matrices of graphs. These algorithms motivate and rely upon fascinating primitives in graph theory, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2019
ISSN: 0377-0427
DOI: 10.1016/j.cam.2018.07.031